Workshop Organization Programme Chairs Programme Committee Integrating Semantic Web Services and Matchmaking in Ebxml Registry 69 an Interest-based Offer Evaluation System for Semantic Matchmakers . . . 99 Probabilistic Methods for Service Clustering
نویسندگان
چکیده
This paper focuses on service clustering and uses service descriptions to construct probabilistic models for service clustering. We discuss how service descriptions can be enriched with machine-interpretable semantics and then we investigate how these service descriptions can be grouped in clusters in order to make discovery, ranking, and recommendation faster and more effective. We propose using Probabilistic Latent Semantic Analysis (PLSA) and Latent Dirichlet Allocation (LDA) (i.e. two machine learning techniques used in Information Retrieval) to learn latent factors from the corpus of service descriptions and group services according to their latent factors. By creating an intermediate layer of latent factors between the services and their descriptions, the dimensionality of the model is reduced and services can be searched and linked together based on probabilistic methods in latent space. The model can cluster any newly added service with a direct calculation without requiring to re-calculate the latent variables or re-train the model.
منابع مشابه
Web service discovery based on semantic information: query formulation and adaptive matchmaking
Service-oriented Computing introduces a range of possible applications spanning from the combination of Web services in software mashups to the design and implementation of entire IT system landscapes following the paradigm of Service-oriented Architectures. The discovery of services which provide a desired capability is one of the basic operations in Service-oriented Computing and is deemed to...
متن کاملEvaluating Semantic Web Service Matchmaking Effectiveness Based on Graded Relevance
Semantic web services (SWS) promise to take service oriented computing to a new level by allowing to semi-automate timeconsuming programming tasks. At the core of SWS are solutions to the problem of SWS matchmaking, i.e., the problem of comparing semantic goal descriptions with semantic offer descriptions to determine services able to fulfill a given request. Approaches to this problem have so ...
متن کاملIntegrating Semantic Web Services and Matchmaking into ebXML Registry
While the “Universal Description, Discovery and Integration” (UDDI) service registry standard has drawn great attention by the research community, it has not been widely adopted by the software industry. Objections towards UDDI include technical as well as conceptional arguments. Being an official ISO standard and providing a number of features UDDI is missing, “Electronic Business using Extens...
متن کاملA procedure for Web Service Selection Using WS-Policy Semantic Matching
In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...
متن کاملA Semantic Web Approach to Service Description for Matchmaking of Services
Matchmaking is an important aspect of e-commerce interactions. Advanced matchmaking services require rich and flexible metadata that are not supported by currently available industry standard frameworks for e-commerce such as UDDI and ebXML. The semantic web initiative at W3C is gaining momentum and generating technologies and tools that might help bridge the gap between the current standard so...
متن کامل